Lossless Compression of Multispectral Images Using Prediction and Golomb Rice Coding

نویسندگان

  • Ma Long
  • Shi Zelin
  • Chen Yonghong
چکیده

Lossless compression algorithms of multispectral images are typically divided into two stages, a decorrelation stage and a coding stage. This work deals with the design of predictors for the decorrelation stage which are both fast and good. to achieve this, both spectral and spatial correlations are used for the predictor. The residuals between the predicted values and real values are calculated. The residuals are entropy-coded band by band using a golomb rice coder. We show that the proposed algorithm is capable of achieving compression ratios superior for multispectral images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossless Compression of Multispectral Images using Spectral Information

Multispectral images are available for different purposes due to developments in spectral imaging systems. The sizes of multispectral images are enormous. Thus transmission and storage of these volumes of data require huge time and memory resources. That is why compression algorithms must be developed. A salient property of multispectral images is that strong spectral correlation exists through...

متن کامل

Simple fast and adaptive lossless image compression algorithm

In this paper we present a new lossless image compression algorithm. To achieve the high compression speed we use a linear prediction, modified Golomb–Rice code family, and a very fast prediction error modeling method. We compare the algorithm experimentally with others for medical and natural continuous tone grayscale images of depths of up to 16 bits. Its results are especially good for big i...

متن کامل

CS - - 1994 - - 10 Fast and Efficient Lossless Image Compression

We present a new method for lossless image compression that gives compression comparable to JPEG lossless mode with about ve times the speed. Our method, called FELICS, is based on a novel use of two neighboring pixels for both prediction and error modeling. For coding we use single bits, adjusted binary codes, and Golomb or Rice codes. For the latter we present and analyze a provably good meth...

متن کامل

An Optimum Novel Technique Based on Golomb-Rice Coding for Lossless Image Compression of Digital Images

New innovative research trends are more essential in the area of image compression for various imaging applications. These applications require good visual quality in processing. In general the tradeoff between compression efficiency and picture quality is the most important parameter to validate the work. The existing algorithms for still image compression were developed by considering the com...

متن کامل

Recent Developments in Context-Based Predictive Techniques for Lossless Image Compression

In this paper we describe some recent developments that have taken place in context-based predictive coding, in response to the JPEG/JBIG committee's recent call for proposals for a new international standard on lossless compression of continuous-tone images. We describe the different prediction techniques that were proposed and give a performance comparison. We describe the notion of context-b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009